Solving Nonlinear Polynomial Systems via Symbolic-Numeric Elimination Method
نویسندگان
چکیده
Consider a general polynomial system S in x1, . . . , xn of degree q and its corresponding vector of monomials of degree less than or equal to q. The system can be written as M0 · [xq1, xq−1 1 x2, . . . , xn, x1, . . . , xn, 1] = [0, 0, . . . , 0, 0, . . . , 0, 0] (1) in terms of its coefficient matrix M0. Here and hereafter, [...] T means the transposition. Further, [ξ1, ξ2, . . . , ξn] is one of the solutions of the polynomial system, if and only if [ξ 1 , ξ q−1 1 ξ2, . . . , ξ 2 n, ξ1, . . . , ξn, 1] T (2) is a null vector of the coefficient matrix M0. Since the number of monomials is usually bigger than the number of polynomials, the dimension of the null space can be big. The aim of completion methods, such as ours and those based on Gröbner bases and others [4, 5, 6, 7, 8, 10, 16, 18, 17, 12, 9, 20], is to include additional polynomials belonging to the ideal generated by S, to reduce the dimension to its minima. The bijection φ : xi ↔ ∂ ∂xi , 1 ≤ i ≤ n, (3) maps the system S to an equivalent system of linear homogeneous PDEs denoted by R. Jet space approaches are concerned with the study of the jet variety V (R) = {( u q , u q−1 , . . . , u 1 , u ) ∈ J : R ( u q , u q−1 , . . . , u 1 , u ) = 0 } , (4) where u j denotes the formal jet coordinates corresponding to derivatives of order exactly j. A single prolongation of a system R of order q consists of augmenting the system with all possible derivatives of its equations, so that the resulting augmented systems, denoted by DR, has order q + 1. Under the bijection φ, the equivalent operation for polynomial systems is to multiply by monomials, so that the resulting augmented system has degree q + 1. A single geometric projection is defined as E(R) := {( u q−1 , . . . , u 1 , u ) ∈ Jq−1 : ∃ u q , R ( u q , u q−1 , . . . , u 1 , u ) = 0 } . (5)
منابع مشابه
Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
We briefly survey several existing methods for solving polynomial system with inexact coefficients, then introduce our new symbolic-numeric method which is based on the geometric (Jet) theory of partial differential equations. The method is stable and robust. Numerical experiments illustrate the performance of the new method.
متن کاملSolving Nonlinear Systems by Constraint Inversion and Interval Arithmetic
A reliable symbolic-numeric algorithm for solving nonlinear systems over the reals is designed. The symbolic step generates a new system, such the formulas are different but the solutions are preserved, through partial factorizations of polynomial expressions, and constraint inversion. The numeric step is a branch-and-prune algorithm based on interval constraint propagation to compute a set of ...
متن کاملComputational Polynomial Algebra and Its Biological Applications
This is an informal note that provides basic information about methods and software tools of resultants, triangular sets, Gröbner bases, real solving, quantifier elimination, and symbolic-numeric computation developed in computational polynomial algebra. Some recent applications of the methods and tools to the study of biological networks are discussed briefly.
متن کاملSymbolic and Numeric Methods for Exploiting Structure in Constructing Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear poly nomial equations while their matrices reduce the computation of all common zeros to a problem in linear algebra Sparse elimination theory has introduced the sparse resul tant which takes into account the sparse structure of the polynomials The construction of sparse resultant or Newton matrices is the criti...
متن کاملPythagore ’ s Dilemma , Symbolic - Numeric Com - putation , and the Border Basis Method
In this tutorial paper, we first discuss the motivation of doing symbolic-numeric computation, with the aim of developing efficient and certified polynomial solvers. We give a quick overview of fundamental algebraic properties, used to recover the roots of a polynomial system, when we know the multiplicative structure of its quotient algebra. Then, we describe the border basis method, justifyin...
متن کاملNumeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
We consider a family of polynomial systems which arises in the analysis of the stationary solutions of a standard discretization of certain semilinear second order parabolic partial differential equations. We prove that this family is well–conditioned from the numeric point of view, and ill–conditioned from the symbolic point of view. We exhibit a polynomial–time numeric algorithm solving any m...
متن کامل